我们最近提出了一个以DBM为中心的新群集操作系统堆栈DBO。DBO通过将ML代码封装在存储过程中，集中辅助ML数据，为基础DBMS内置的安全性，共同关注ML代码和数据以及跟踪数据和工作流源来源，从而为ML应用程序提供了独特的支持。在这里，我们在两个ML应用程序附近演示了这些好处的子集。我们首先表明，使用GPU的图像分类和对象检测模型可以用作DBOS存储程序，具有与现有系统竞争性能的DBOS存储程序。然后，我们提出了一项1D CNN，训练有素，可以在DBOS支持的Web服务上检测HTTP请求中的异常情况，从而实现SOTA结果。我们使用此模型来开发交互式异常检测系统，并通过定性用户反馈对其进行评估，并证明了其有用性作为未来工作的概念证明，以在DBO上开发实时的实时安全服务。

语言模型既展示了定量的改进，又展示了新的定性功能，随着规模的增加。尽管它们具有潜在的变革性影响，但这些新能力的特征却很差。为了为未来的研究提供信息，为破坏性的新模型能力做准备，并改善社会有害的效果，至关重要的是，我们必须了解目前和近乎未来的能力和语言模型的局限性。为了应对这一挑战，我们介绍了超越模仿游戏基准（Big Bench）。 Big Bench目前由204个任务组成，由132家机构的442位作者贡献。任务主题是多样的，从语言学，儿童发展，数学，常识性推理，生物学，物理学，社会偏见，软件开发等等。 Big-Bench专注于被认为超出当前语言模型的功能的任务。我们评估了OpenAI的GPT型号，Google内部密集变压器体系结构和大型基础上的开关稀疏变压器的行为，跨越了数百万到数十亿个参数。此外，一个人类专家评估者团队执行了所有任务，以提供强大的基准。研究结果包括：模型性能和校准都随规模改善，但绝对的术语（以及与评估者的性能相比）；在模型类中的性能非常相似，尽管带有稀疏性。逐渐和预测的任务通常涉及大量知识或记忆成分，而在临界规模上表现出“突破性”行为的任务通常涉及多个步骤或组成部分或脆性指标；社交偏见通常会随着含糊不清的环境而随着规模而增加，但这可以通过提示来改善。

人工智能尚未彻底改变材料和分子的设计。在这种观点中，我们确定了四个障碍，阻碍了原子深度学习，分子科学和高性能计算的整合。我们概述了重点的研究努力，解决这些挑战所提供的机会。

分子和材料科学的深度学习受应用科学，人工智能和高性能计算之间缺乏融合的限制。关于培训数据量，模型架构的规模和复杂程度以及计算基础设施的规模的瓶颈是限制分子和材料深度学习缩放的关键因素。在这里，我们呈现$ \ texit {litmatter} $，轻量级框架用于缩放分子深度学习方法。我们在超过400个GPU上培训四个图形神经网络架构，并调查这些方法的缩放行为。根据模型架构，可以看到高达60美元的培训时间加速。经验神经缩放关系量化模型依赖性缩放，使能最优计算资源分配和可伸缩分子几何深度学习模型实现的识别。

提出了一种能够改变形状中空飞行的新型Quadcopter，允许在四种配置中进行操作，其中包含持续的悬停在三个配置中。这是实现的，而不需要超出Quadcopter典型的四个电动机的执行器。通过自由旋转铰链来实现变形，使车臂通过减少或逆转推力向下折叠。放置在车辆的控制输入上的约束防止臂意外折叠或展开。这允许使用现有的四转器控制器和轨迹生成算法，只有最小的增加的复杂性。对于我们在悬停的实验载体中，我们发现这些约束导致车辆可以产生的最大偏航扭矩的36％减少，但不会导致最大推力或卷和螺距扭矩的减少。实验结果表明，对于典型的操纵，增加的限制对轨迹跟踪性能的影响忽略不计。最后，示出了改变配置的能力，使车辆能够在悬挂导线上移动小通道，并且执行有限的抓取任务。

Making histopathology image classifiers robust to a wide range of real-world variability is a challenging task. Here, we describe a candidate deep learning solution for the Mitosis Domain Generalization Challenge 2022 (MIDOG) to address the problem of generalization for mitosis detection in images of hematoxylin-eosin-stained histology slides under high variability (scanner, tissue type and species variability). Our approach consists in training a rotation-invariant deep learning model using aggressive data augmentation with a training set enriched with hard negative examples and automatically selected negative examples from the unlabeled part of the challenge dataset. To optimize the performance of our models, we investigated a hard negative mining regime search procedure that lead us to train our best model using a subset of image patches representing 19.6% of our training partition of the challenge dataset. Our candidate model ensemble achieved a F1-score of .697 on the final test set after automated evaluation on the challenge platform, achieving the third best overall score in the MIDOG 2022 Challenge.

Supervised Question Answering systems (QA systems) rely on domain-specific human-labeled data for training. Unsupervised QA systems generate their own question-answer training pairs, typically using secondary knowledge sources to achieve this outcome. Our approach (called PIE-QG) uses Open Information Extraction (OpenIE) to generate synthetic training questions from paraphrased passages and uses the question-answer pairs as training data for a language model for a state-of-the-art QA system based on BERT. Triples in the form of <subject, predicate, object> are extracted from each passage, and questions are formed with subjects (or objects) and predicates while objects (or subjects) are considered as answers. Experimenting on five extractive QA datasets demonstrates that our technique achieves on-par performance with existing state-of-the-art QA systems with the benefit of being trained on an order of magnitude fewer documents and without any recourse to external reference data sources.

While the capabilities of autonomous systems have been steadily improving in recent years, these systems still struggle to rapidly explore previously unknown environments without the aid of GPS-assisted navigation. The DARPA Subterranean (SubT) Challenge aimed to fast track the development of autonomous exploration systems by evaluating their performance in real-world underground search-and-rescue scenarios. Subterranean environments present a plethora of challenges for robotic systems, such as limited communications, complex topology, visually-degraded sensing, and harsh terrain. The presented solution enables long-term autonomy with minimal human supervision by combining a powerful and independent single-agent autonomy stack, with higher level mission management operating over a flexible mesh network. The autonomy suite deployed on quadruped and wheeled robots was fully independent, freeing the human supervision to loosely supervise the mission and make high-impact strategic decisions. We also discuss lessons learned from fielding our system at the SubT Final Event, relating to vehicle versatility, system adaptability, and re-configurable communications.

Feature selection helps reduce data acquisition costs in ML, but the standard approach is to train models with static feature subsets. Here, we consider the dynamic feature selection (DFS) problem where a model sequentially queries features based on the presently available information. DFS is often addressed with reinforcement learning (RL), but we explore a simpler approach of greedily selecting features based on their conditional mutual information. This method is theoretically appealing but requires oracle access to the data distribution, so we develop a learning approach based on amortized optimization. The proposed method is shown to recover the greedy policy when trained to optimality and outperforms numerous existing feature selection methods in our experiments, thus validating it as a simple but powerful approach for this problem.

While the brain connectivity network can inform the understanding and diagnosis of developmental dyslexia, its cause-effect relationships have not yet enough been examined. Employing electroencephalography signals and band-limited white noise stimulus at 4.8 Hz (prosodic-syllabic frequency), we measure the phase Granger causalities among channels to identify differences between dyslexic learners and controls, thereby proposing a method to calculate directional connectivity. As causal relationships run in both directions, we explore three scenarios, namely channels' activity as sources, as sinks, and in total. Our proposed method can be used for both classification and exploratory analysis. In all scenarios, we find confirmation of the established right-lateralized Theta sampling network anomaly, in line with the temporal sampling framework's assumption of oscillatory differences in the Theta and Gamma bands. Further, we show that this anomaly primarily occurs in the causal relationships of channels acting as sinks, where it is significantly more pronounced than when only total activity is observed. In the sink scenario, our classifier obtains 0.84 and 0.88 accuracy and 0.87 and 0.93 AUC for the Theta and Gamma bands, respectively.